On achieving channel capacity in finite-memory channels

Capacity-Achieving Schemes for Finite-State Channels

Capacity-Achieving Schemes for Finite-State Channels

On Channels with Finite Holevo Capacity

Capacity-Achieving Codes with Bounded Graphical Complexity on Noisy Channels

We introduce a new family of concatenated codes with an outer low-density parity-check (LDPC) code and an inner low-density generator matrix (LDGM) code, and prove that these codes can achieve capacity under any memoryless binaryinput output-symmetric (MBIOS) channel using maximum-likelihood (ML) decoding with bounded graphical complexity, i.e., the number of edges per information bit in their ...

Capacity-achieving sequences for the erasure channel

This paper starts a systematic study of capacity achieving sequences of low density parity check codes for the erasure channel We introduce a class A of analytic functions and develop a procedure to obtain degree distributions for the codes We show various properties of this class which will help us construct new distributions from old ones We then study certain types of capacity achieving sequ...

Channel Polarization and Polar Codes; Capacity Achieving

A new proposed method for constructing codes that achieves the symmetric capacity (the capacity of the channel with the same probabilities for the inputs), ( ) I W , of any Binary Discrete Memoryless Channel W (B-DMC) will be introduced in this tutorial. This method is based on channel polarization. Channel polarization is the fact that we can synthesize N channels, ( ) { } :1 i N W i N ≤ ≤ , o...